Improvement of the PBFT Algorithm Based on Grouping and Reputation Value Voting

An improved practical Byzantine fault tolerance (Practical Fault Tolerant consensus algorithm based on reputation, RPBFT) grouping and reputation value voting is proposed for the problems of high communication complexity, poor scalability, random selection master nodes (PBFT) consortium chain. First, consistency process optimized to take response speed each group leader as basis grouping, intragroup performed. The then takes result participates in extra-group reduce frequency time internode communication. Second, model mechanism are proposed, generated by node voting, which enhances initiative reliability trusted reduces abnormal leader. Finally, a simulation performance testing system this scheme built prove effectiveness well usability through experiments. experimental results show that when number network 36, throughput RPBFT six times PBFT. Therefore, delay reduced 91.7%, overhead 37.8%.